Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
361	A Sublinear Time Algorithm for PageRank Computations Christian Borgs1 , Michael Brautbar2 , Jennifer Chayes1 , and Shang-Hua Teng3 1 Microsoft Research New England, One Memorial Drive, Cambridge, MA 02142 Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-07-30 13:11:35 Link analysis Markov models Analysis of algorithms PageRank Reputation management Search engine optimization Randomized algorithm Time complexity Webgraph Theoretical computer science Computational complexity theory Mathematics
362	A QPTAS for the Base of the Number of Triangulations of a Planar Point Set Marek Karpinski 1 2 3 Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2014-11-05 03:34:31 Graph theory Catalan number Planar separator theorem Independent set Time complexity Polygon triangulation Delaunay triangulation Mathematics Theoretical computer science Triangulation
363	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
364	Requirements Engineering Foundations Course Background: Increasing complexity of systems to be developed and more stringent constraints on costs, quality and development time, mean we have to find all the possible improv Add to Reading List Source URL: www.mithun.nl Language: English - Date: 2011-08-29 09:44:56 Systems engineering Systems Modeling Language Software engineering Requirement Software development process Systems engineering process Use case Functional requirement Capability Maturity Model Integration Software development Software requirements Software
365	doi:j.ipl Add to Reading List Source URL: www.cc.ntut.edu.tw Language: English - Date: 2008-03-02 23:12:13 Automated theorem proving NP-complete problems Unit propagation 2-satisfiability Time complexity Variable MAX-3SAT (SAT ε-UNSAT) Theoretical computer science Mathematics Computational complexity theory
366	Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-04-27 00:54:51 Computability theory Analysis of algorithms Descriptive complexity Kolmogorov complexity Bounded-error probabilistic polynomial FO PP IP Time complexity Theoretical computer science Computational complexity theory Applied mathematics
367	Guaranteed Scheduling for Switches with Configuration Overhead Brian Towles and William J. Dally Abstract— In this paper we present three algorithms that provide performance guarantees for scheduling switches, such as Add to Reading List Source URL: cva.stanford.edu Language: English - Date: 2005-12-01 13:38:04 Switches Analysis of algorithms Scheduling algorithms Computational complexity theory Scheduling Speedup Time complexity Graph coloring Crossbar switch Theoretical computer science Applied mathematics Mathematics
368	Prices Matter for the Parameterized Complexity of Shift Bribery Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Andr´e Nichterlein1 , and Rolf Niedermeier1 1 TU Berlin, Berlin, Germany {robert.bredereck, jiehua. Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-05-07 05:57:23 Analysis of algorithms Social choice theory Single winner electoral systems Parameterized complexity Borda count Voting system Time complexity FO Reduction Theoretical computer science Computational complexity theory Applied mathematics
369	Improved Soundness for QMA with Multiple Provers Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-01-14 01:47:53 Quantum complexity theory QMA Probabilistic complexity theory Proof theory Model theory IP Probabilistically checkable proof Cook–Levin theorem Time complexity Theoretical computer science Computational complexity theory Applied mathematics
370	Linear Work Suffix Array Construction Juha K¨arkk¨ainen∗ Peter Sanders† Stefan Burkhardt‡ Add to Reading List Source URL: www.cs.helsinki.fi Language: English - Date: 2005-04-19 08:55:49 Sorting algorithms Analysis of algorithms Arrays Suffix array Suffix tree Time complexity Radix sort In-place algorithm Algorithm Mathematics Theoretical computer science Applied mathematics

UPDATE